Random Costs in Combinatorial Optimization

Combinatorial optimization problems with normal random costs

We consider combinatorial optimization problems with random jointly normal costs. Target-probability efficient solutions are those that grant a given target at a certain probability and no other solution can grant the same target at a higher probability. Since the costs belong to a location-scale family the efficient solutions have a simple geometric characterization in terms of mean and varian...

Combinatorial optimization over two random point sets

We analyze combinatorial optimization problems over a random pair of points (X ,Y) in R of equal cardinal. Typical examples include the matching of minimal length, the traveling salesperson tour constrained to alternate between points of each set, or the connected bipartite r-regular graph of minimal length. As the cardinal of the sets goes to infinity, we investigate the convergence of such bi...

Considering Stochastic and Combinatorial Optimization

Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...

Combinatorial optimization problems with uncertain costs and the OWA criterion

In this paper a class of combinatorial optimization problems with uncertain costs is discussed. The uncertainty is modeled by specifying a discrete scenario set containing K distinct cost scenarios. The Ordered Weighted Averaging (OWA for short) aggregation operator is applied to choose a solution. Some well known criteria used in decision making under uncertainty such as the maximum, minimum, ...

Topics in random graphs, combinatorial optimization, and statistical inference